Regular Tree Model Checking

نویسندگان

  • Parosh Aziz Abdulla
  • Bengt Jonsson
  • Pritha Mahata
  • Julien d'Orso
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract Regular Tree Model Checking with Nondeterministic Automata

Regular Tree Model Checking with Nondeterministic Automata

متن کامل

Cut - offs and Automata in Formal Verification of Infinite - State Systems Habilitation

In this habilitation thesis, we discuss two complementary approaches to formal verification of infinite-state systems—namely, the use cut-offs and automata-based symbolic model checking (especially the so-called regular model checking). The thesis is based on extended versions of multiple conference and journal papers joint into a unified framework and accompanied with a significantly extended ...

متن کامل

Towards Applying Mona in Abstract Regular Tree Model Checking

We consider the problem of automated formal verification of modern concurrent software systems. Dealing with such systems, which involves handling unbounded dynamic instantiation, recursion, etc., naturally leads to a need of dealing with infinite state spaces. We suppose states of such systems to be encoded terms with a tree structure and we would like to use the abstract regular tree model ch...

متن کامل

INFINITY 2005 Preliminary Version Abstract Regular Tree Model Checking

Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1,2 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tomáš Vojnar 3,4 FIT, Brno University of Technology, Božetěchova 2, CZ-61266, Brno, Czech Republic

متن کامل

Verification of Programs with Complex Data

In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002